Salvage-Embeddings of Complete Trees

نویسندگان

  • Sandeep N. Bhatt
  • Fan Chung Graham
  • Frank Thomson Leighton
  • Arnold L. Rosenberg
چکیده

A salvage-embedding (S-embedding) maps a complete binary tree G into a larger complete binary tree H some fraction of whose leaves have been labeled good. The S-embedding maps leaves of G one-to-one to good leaves of H; it may be many-to-one on internal nodes. We measure the quality of an S-embedding by its harvest, the fraction H of good leaves of H that are images of leaves of G, and its congestion, the largest number of edges of G that get “routed” across the same edge of H. We consider three scenarios for an N -leaf tree H. In the worst-case scenario: if the fraction G of H’s leaves are labeled good, then one can S-embed an HGN -leaf G in H with congestion log logN+ a constant depending only on G and H, no matter how the good leaves are distributed; this congestion cannot be lowered by more than a small constant factor. In the expected-case scenario, where leaves of H are labeled good or not, independently, with fixed probability: with probability exceeding 1−N−Ω(1), for any 0 < H ≤ 1/8, one can S-embed an HN -leaf G in H with congestion O(log log logN); we do not know if this congestion can be lowered. In the salvaging scenario: we present an algorithm that, in time O(N(logN)3C+2), S-embeds in a given a leaf-labeled H the largest possible G, subject to the prespecified bound C on congestion. This work is motivated by the problem of salvaging a fault-free subnetwork of a leaf-tree machine — a tree architecture whose leaves hold “full-power” PEs and whose nonleaf nodes hold “rudimentary” PEs that route messages and perform simple combining tasks. ————————————⋆ A preliminary version of this paper was presented at CONPAR/92, Lyon, France, September 1-4, 1992. Authors’ Mailing Addresses: S.N. Bhatt: Dept. of Computer Science, Yale University, New Haven, CT 06520 F.R.K. Chung: Bell Communications Research, 435 South St., Morristown, NJ 07960 F.T. Leighton: Dept. of Mathematics and Lab. for Computer Science, MIT, Cambridge, MA 02139 A.L. Rosenberg: Dept. of Computer Science, University of Massachusetts, Amherst, MA 01003

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Complete Binary Trees into Star Networks

Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...

متن کامل

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes

The double-rooted complete binary tree is a complete binary tree where the path (of length ) between the children of the root is replaced by a path of length . It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into the hypercube does not pr...

متن کامل

Embeddings and Other Mappings of Rooted Trees Into Complete Trees

Let Tn be the complete binary tree of height n, with root 1n as the maximum element. For T a tree, define A(n;T ) = |{S ⊆ Tn : 1n ∈ S, S ∼= T}| and C(n;T ) = |{S ⊆ Tn : S ∼= T}|. We disprove a conjecture of Kubicki, Lehel and Morayne, which claims that A(n;T1) C(n;T1) ≤ A(n;T2) C(n;T2) for any fixed n and arbitrary rooted trees T1 ⊆ T2. We show that A(n;T ) is of the form ∑l j=0 qj(n)2 jn where...

متن کامل

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf spawns two new leaves. In this paper, we present simple dynamic embeddings of double-rooted comp...

متن کامل

Embeddings of complete binary trees into star graphs with congestion 1

In this paper, we giae a conslruc2io1~ of embeddings of vertex-congestion 1 and dilaiiou 4 of complete binary trees into star graph,s. The heighl of the trees embedded into th.e n-dimeasloaal star graph S, is(7?+1)~log~nJ-2 L’Ogz nJ+l + 1, which tmprorcs th.e previous result from. [5],[6] by more thnzt n/2 1. Il’e then consiruct em.beddings of zjerter-coagestion 1. dilation at mosi an + 2, of c...

متن کامل

Embedding of Hypercubes into Complete Binary Trees

We estimate and characterize the edge congestion-sum measure for embeddings of hypercubes into complete binary trees. Our algorithms produce optimal values of sum of edge-congestions in linear time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1995